|
週次 |
日期 |
單元主題 |
|
Week 1 |
|
Introduction
Asymptotic Notations
|
|
Week 2 |
|
Asymptotic Notations (Cont'd)
Recurrence Relations |
|
Week 3 |
|
No Class，make up class on 9/16(Sat)
Recurrence Relations (Cont'd)
Divide & Conquer Algorithms
Comparison Sorting |
|
Week 4 |
|
No class |
|
Week 5 |
|
Comparison Sorting (Cont'd)
Order Statistics |
|
Week 6 |
|
Greedy Algorithms
Dynamic Programming |
|
Week 7 |
|
Non-Comparison Sorting
Heap Structure
Amortized Analysis |
|
Week 8 |
|
Fibonacci Heap |
|
Week 9 |
|
Midterm |
|
Week 10 |
|
No class |
|
Week 11 |
|
Disjoint Set
Definition of Graph |
|
Week 12 |
|
Searching Algorithms
Topological Sort |
|
Week 13 |
|
Shortest Path Problem & Algorithms |
|
Week 14 |
|
Minimum Spanning Tree
Flow Network
Max Flow Problem |
|
Week 15 |
|
Edmonds-Karp Algorithm
Maximum Matching & Stable Matching
Gale-Shapley Proposing Algorithm
Decision Problem
P & NP
NP-completeness
|
|
Week 16 |
|
NP-complete Reduction
Approximate Algorithms |
|
Week 17 |
|
Approximation Algorithms (Cont'd)
|
|
Week 18 |
|
Final |